Shading-based refinement on volumetric signed distance functions
نویسندگان
چکیده
منابع مشابه
Similarity Registration for Shapes Based on Signed Distance Functions
A fast algorithm for similarity registration for shapes with various topologies is put forward in this paper. Fourier transform and Geometric moments are explored here to calculate the rotation, scaling and translation parameters to register two shapes by minimizing a dissimilarity measure introduced in the literature. Shapes are represented by signed distance functions. In comparison with the ...
متن کاملVolume-Based Semantic Labeling with Signed Distance Functions
Research works on the two topics of Semantic Segmentation and SLAM (Simultaneous Localization and Mapping) have been following separate tracks. Here, we link them quite tightly by delineating a category label fusion technique that allows for embedding semantic information into the dense map created by a volume-based SLAM algorithm such as KinectFusion. Accordingly, our approach is the first to ...
متن کاملFuzzy Production Inventory Based on Signed Distance
In crisp production inventory problem, let q, a, b, d, R and r be the quantity produced per cycle, the holding cost, production cost, production quantity per day, the total demand quantity and the demand quantity per day, respectively. We consider three fuzzification methods. Firstly, we fuzzify q, a, b, d, R and r to triangular fuzzy numbers. Secondly, we fuzzify d and r to triangular fuzzy nu...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Diffusion generated motion using signed distance functions
We describe a new class of algorithms for generating a variety of geometric interfacial motions by alternating two steps: Construction of the signed distance function (i.e. redistancing) to the interface, and convolution with a suitable kernel. These algorithms can be seen as variants of Merriman, Bence, and Osher’s threshold dynamics [25]. The new algorithms proposed here preserve the computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2015
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2766887